1150B - Tiling Challenge - CodeForces Solution


greedy implementation *900

Please click on ads to support us..

C++ Code:

    #include<bits/stdc++.h>
    #define int long long
    using namespace std;
     
    char a[101][101];
    signed main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        for(int i=0;i<=100;i++){
            for(int j=0;j<=100;j++)
              a[i][j]='#';
        }
        int n;
        cin>>n;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                cin>>a[i][j];
            }
        }
        bool flag=true;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(a[i][j]=='.'){
                    if(a[i+1][j-1]=='#' || a[i+1][j]=='#' || a[i+1][j+1]=='#' || a[i+2][j]=='#'){
                        flag=false;
                    }
                        a[i][j]=a[i+1][j-1]=a[i+1][j]=a[i+1][j+1]=a[i+2][j]='#';
                }
            }
        }
        	if(flag)
    		cout<<"Yes"<<endl;
    	else
    		cout<<"NO"<<endl;
        return 0;
    }


Comments

Submit
0 Comments
More Questions

921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset